Characterizations of finite and infinite episturmian words via lexicographic orderings
نویسندگان
چکیده
In this paper, we characterize by lexicographic order all finite Sturmian and episturmian words, i.e., all (finite) factors of such infinite words. Consequently, we obtain a characterization of infinite episturmian words in a wide sense (episturmian and episkew infinite words). That is, we characterize the set of all infinite words whose factors are (finite) episturmian. Similarly, we characterize by lexicographic order all balanced infinite words over a 2-letter alphabet; in other words, all Sturmian and skew infinite words, the factors of which are (finite) Sturmian.
منابع مشابه
Sturmian and Episturmian Words (A Survey of Some Recent Results)
This survey paper contains a description of some recent results concerning Sturmian and episturmian words, with particular emphasis on central words. We list fourteen characterizations of central words. We give the characterizations of Sturmian and episturmian words by lexicographic ordering, we show how the Burrows-Wheeler transform behaves on Sturmian words. We mention results on balanced epi...
متن کاملInequalities characterizing standard Sturmian and episturmian words
Considering the smallest and the greatest factorswith respect to the lexicographic orderwe associate to each infinite word r two other infinite words min(r) and max(r). In this paper we prove that the inequalities as min(s) max(s) bs characterize standard Sturmian words (proper ones and periodic ones) and that the condition “for any x ∈ A and lexicographic order< satisfying x=min(A) one has xs ...
متن کاملA characterization of fine words over a finite alphabet
To any infinite word t over a finite alphabet A we can associate two infinite words min(t) and max(t) such that any prefix of min(t) (resp. max(t)) is the lexicographically smallest (resp. greatest) amongst the factors of t of the same length. We say that an infinite word t over A is fine if there exists an infinite word s such that, for any lexicographic order, min(t) = as where a = min(A). In...
متن کاملPseudopalindrome closure operators in free monoids
We consider involutory antimorphisms θ of a free monoid A∗ and their fixed points, called θ-palindromes or pseudopalindromes. A θ-palindrome reduces to a usual palindrome when θ is the reversal operator. For any word w ∈ A∗ the right (resp. left) θ-palindrome closure of w is the shortest θ-palindrome having w as a prefix (resp. suffix). We prove some results relating θ-palindrome closure operat...
متن کاملOrder and quasiperiodicity in episturmian words
In this paper, we build upon previous work concerning inequalities characterizing Sturmian and episturmian words – see [19, 29, 30, 14, 16]. First let us recall from [29] the following notion relating to lexicographic order. Let A be a totally ordered finite alphabet consisting of at least two letters. To any infinite word x over A, we can associate two infinite words min(x) and max(x) such tha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Eur. J. Comb.
دوره 29 شماره
صفحات -
تاریخ انتشار 2008